Timely Status Updating Over Erasure Channels Using an Energy Harvesting Sensor: Single and Multiple Sources
نویسندگان
چکیده
A status updating system is considered in which data from multiple sources are sampled by an energy harvesting sensor and transmitted to a remote destination through erasure channel. The goal deliver updates of all timely manner, such that the cumulative long-term average age-of-information (AoI) minimized. AoI for each source defined as time elapsed since generation latest successful update received at source. Transmissions subject availability, arrives units according Poisson process, with unit capable carrying out one transmission only equipped unit-sized battery save incoming energy. scheduling policy designed order determine using available problem studied two main settings: 1) no feedback 2) perfect instantaneous feedback. For case source, it shown xmlns:xlink="http://www.w3.org/1999/xlink">renewal policies optimal, instances form renewal process. In setting without feedback, further xmlns:xlink="http://www.w3.org/1999/xlink">threshold-based if until new exceeds certain threshold. threshold-greedy policies investigated, threshold-based following transmissions, instantaneously whenever failed transmissions. optimal thresholds found closed-form terms probability. Such then extended sources, combined xmlns:xlink="http://www.w3.org/1999/xlink">round robin same repeating order; xmlns:xlink="http://www.w3.org/1999/xlink">maximum-age-first maximum given priority. both settings, achieved derived threshold, probability number sources.
منابع مشابه
Coded Status Updates in an Energy Harvesting Erasure Channel
We consider an energy harvesting transmitter sending status updates to a receiver over an erasure channel, where each status update is of length k symbols. The energy arrivals and the channel erasures are independent and identically distributed (i.i.d.) and Bernoulli distributed in each slot. In order to combat the effects of the erasures in the channel and the uncertainty in the energy arrival...
متن کاملOptimal Status Updating for an Energy Harvesting Sensor with a Noisy Channel
Consider an energy harvesting sensor continuously monitors a system and sends time-stamped status update to a destination. The destination keeps track of the system status through the received updates. Under the energy causality constraint at the sensor, our objective is to design an optimal online status updating policy to minimize the long-term average Age of Information (AoI) at the destinat...
متن کاملSequential Transmission of Markov Sources over Burst Erasure Channels
We study the sequential coding of a Markov source process under error propagation and decoding delay constraints. The source sequence at each time is sampled i.i.d. along the spatial dimension and from a first order Markov process along the temporal dimension. The channel can introduce a single erasure burst of maximum length B starting at any arbitrary time. The encoder must operate in a causa...
متن کاملMultiple description coding over multiple correlated erasure channels
This paper examines the use of Multiple Description Coding (MDC) for information transmission over multiple correlated erasure channels. It addresses the problem of optimal rate allocation between descriptions to attain the minimum possible average distortion at the receiver. The rate allocation problem is formulated on the basis of rate-distortion theory for the general case of unbalanced MDC ...
متن کاملSequential Coding of Markov Sources over Burst Erasure Channels
We study sequential coding of Markov sources under an error propagation constraint. An encoder sequentially compresses a sequence of vector-sources that are spatially i.i.d. but temporally correlated according to a first-order Markov process. The channel erases up to B packets in a single burst, but reveals all other packets to the destination. The destination is required to reproduce all the s...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE transactions on green communications and networking
سال: 2022
ISSN: ['2473-2400']
DOI: https://doi.org/10.1109/tgcn.2021.3105881